Prüfer-Like Conditions in Subring Retracts and Applications
نویسندگان
چکیده
منابع مشابه
On Retracts, Absolute Retracts, and Folds in Cographs
Let G and H be two cographs. We show that the problem to determine whether H is a retract of G is NP-complete. We show that this problem is fixed-parameter tractable when parameterized by the size of H. When restricted to the class of threshold graphs or to the class of trivially perfect graphs, the problem becomes tractable in polynomial time. The problem is also soluble in linear time when on...
متن کاملCurves and coherent Prüfer rings
Usual definitions of Dedekind domain are not well suited for an algorithmic treatment. Indeed, the notion of Noetherian rings is subtle from a constructive point of view, and to be able to get prime ideals involve strong hypotheses. For instance, if k is a field, even given explicitely, there is in general no method to factorize polynomials in k[X]. The work [2] analyses the notion of Dedekind ...
متن کاملSubring Homomorphic Encryption
In this paper, we construct subring homomorphic encryption scheme that is a homomorphic encryption scheme built on the decomposition ring, which is a subring of cyclotomic ring. In the scheme, each plaintext slot contains an integer in Zpl , rather than an element of GF(p) as in conventional homomorphic encryption schemes on cyclotomic rings. Our benchmark results indicate that the subring homo...
متن کاملRetracts and Q-independence
A non-empty set X of a carrier A of an algebra A is called Q-independent if the equality of two term functions f and g of the algebra A on any finite system of elements a1, a2, . . . , an of X implies f(p(a1), p(a2), . . . , p(an)) = g(p(a1), p(a2), . . . , p(an)) for any mapping p ∈ Q. An algebra B is a retract of A if B is the image of a retraction (i.e. of an idempotent endomorphism of B). W...
متن کاملRetracts and Inheritance1
provide the notation and terminology for this paper. 1. POSET RETRACTS One can prove the following propositions: (1) For all binary relations a, b holds a · b = a b. (2) Let X be a set, L be a non empty relational structure, S be a non empty relational substruc-ture of L, f , g be functions from X into the carrier of S, and f , g be functions from X into the carrier of L. If f = f and g = g and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Algebra
سال: 2009
ISSN: 0092-7872,1532-4125
DOI: 10.1080/00927870802182515